Chromatic index of dense quasirandom graphs
نویسندگان
چکیده
Let G be a simple graph with maximum degree Δ(G). A subgraph H of is overfull if |E(H)|>Δ(G)⌊|V(H)|/2⌋. Chetwynd and Hilton in 1986 conjectured that on n vertices Δ(G)>n/3 has chromatic index Δ(G) only contains no subgraph. Glock, Kühn Osthus 2016 showed the conjecture true for dense quasirandom graphs even order, they same should hold such odd order. In this paper, we show affirmative.
منابع مشابه
Bounding the strong chromatic index of dense random graphs
For a graph G, a strong edge coloring of G is an edge coloring in which every color class is an induced matching. The strong chromatic index of G, χs(G), is the smallest number of colors in a strong edge coloring of G. In [9], Z. Palka proved that if p = p(n) = Θ(n−1), then with high probability, χs(G(n, p)) = O(∆(G(n, p))). Recently in [12], V. Vu proved that if n−1(lnn)1+δ ≤ p = p(n) ≤ n−ε fo...
متن کاملOptimal path and cycle decompositions of dense quasirandom graphs
Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let 0 < p < 1 be constant and let G ∼ Gn,p. Let odd(G) be the number of odd degree vertices in G. Then a.a.s. the following hold: (i) G can be decomposed into b∆(G)/2c cycles and a matching of size odd(G)/2. (ii) G can be decompo...
متن کاملChromatic roots and limits of dense graphs
In this short note we observe that recent results of Abért and Hubai and of Csikvári and Frenkel about Benjamini–Schramm continuity of the holomorphic moments of the roots of the chromatic polynomial extend to the theory of dense graph sequences. We offer a number of problems and conjectures motivated by this observation.
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملStrong Chromatic Index of Products of Graphs
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching. In this paper, we present bounds for the strong chromatic index of three different products of graphs in terms of the strong chromatic index of each factor. For the Cartesian product of paths, cycles or complete graphs, we derive sharper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2022
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2022.08.001